منابع مشابه
Beeping a Maximal Independent Set Fast
We adapt a recent algorithm by Ghaffari [7] for computing a Maximal Independent Set in the Local model, so that it works in the significantly weaker Beep model. For networks with maximum degree ∆, our algorithm terminates locally within time O((log∆+log(1/ε)) · log(1/ε)), with probability at least 1− ε. The key idea of the modification is to replace explicit messages about transmission probabil...
متن کاملA Parallel Maximal Independent Set Algorithm
The parallel construction ofmaximal independent sets is a useful building block for many algorithms in the computational sciences, including graph coloring and multigrid coarse grid creation on unstructured meshes. We present an e cient asynchronous maximal independent set algorithm for use on parallel computers, for \well partitioned" graphs, that arise from nite element (FE) models. For appro...
متن کاملComputing a Maximal Independent Set Using Beeps
We consider the problem of finding a maximal independent set (MIS) in the discrete beeping model introduced in DISC 2010. At each time, a node in the network can either beep (i.e., emit a signal) or be silent. Silent nodes can only differentiate between no neighbor beeping, or at least one neighbor beeping. This basic communication model relies only on carrier-sensing. Furthermore, we assume no...
متن کاملConstructing a Maximal Independent Set in Parallel
f a The problem of constructing in parallel a maximal independent set o given graph is considered. A new deterministic NC -algorithm implet mented in the EREW PRAM model is presented. On graphs with n ver ices and m edges, it uses O ((n +m )/logn ) processors and runs in O (log n ) 3 c time. This reduces by a factor of logn both the running time and the pro essor count of the previously fastest...
متن کاملParallel Algorithms for Maximal Independent Set and Maximal Matching
We present a derandomization process which leads to efficient parallel algorithms for the maximal independent set and maximal matching problems. The derandomization of the general pairs PROFIT/COST problem depends on the derandomization of the bit pairs PROFIT/COST problem which follows Luby’s approach of using an O(n) sized sample space. This simplifies the approach presented in [16].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2012
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-012-0175-7